|
In computer science, the Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters. ==History== The Wagner–Fischer algorithm has a history of multiple invention. Navarro lists the following inventors of it, with date of publication, and acknowledges that the list is incomplete:〔 * Vintsyuk, 1968 * Needleman and Wunsch, 1970 * Sankoff, 1972 * Sellers, 1974 * Wagner and Fischer, 1974 * Lowrance and Wagner, 1975 A notable omission from the Navarro list is the 1965 paper by Levenshtein: * Levenshtein, 1965 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Wagner–Fischer algorithm」の詳細全文を読む スポンサード リンク
|